Orderings for term-rewriting systems
نویسندگان
چکیده
منابع مشابه
Tree lifting orderings for termination transformations of term rewriting systems
A technique to prove the termination of a given term rewriting system (TRS, for short) is presented. We propose tree lifting orderings by which from a given TRS R candidates for the termination of R can be obtained|the termination of (at least) one of these candidates guarantees the termination ofR. It should be remarked that for a given nite TRS all its candidates can be computed automatically...
متن کاملTerm Rewriting with Conditionals and Priority Orderings
Conditional re,vriting and priority re,vriting are two recent generalizations of term rewriting systems. In the former, each re\vrite rule is accompanied by an antecedent which must be sho,vn to hold before rewriting can OCCUI. In the latter, re,vrite rules can be used only' in a particular order. We compare these formalisms: neither formalism encompasses the other in a practical sense, but we ...
متن کاملTransfinite Rewriting Semantics for Term Rewriting Systems
We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...
متن کاملNatural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the most efficient of all being the natural rewriting strategy [9]. All the strategies so far, including natural rewriting, assume that the given term rewriting system is a left-linear constructor system. Although these rest...
متن کاملTermination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths
It is shown that a termination proof for a term rewriting system using a lexicographic path ordering yields a multiply recursive bound on the length of derivations, measured in the depth of the starting term. This result is essentially optimal since for every multiply recursive function f a rewrite system (which reduces under the lexicographic path ordering) can be found such that its derivatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90026-3